Bilateral Decision Making Under Asynchronous Time Constraint
نویسنده
چکیده
Decision making is indispensable to any optimization in intelligent computing. In this study, we discuss a mathematical foundation for bilateral decision making under synchronous and asynchronous time constraint. The problem on time constraint is to evaluate the cost of time or the value of the entire duration of certain decision process. We propose a formula to compute the cost of time by introduction of opportunity cost to its evaluation. We also propose two formulas on the strategic points to minimize the cost of time for decision process. under synchronous or common time constraint and asynchronous or uncommon time constraints. The proposed formulas contribute to accelerating time-sensitive decision making, instead of the heuristic point of the half time.
منابع مشابه
Stochastic Multiperiod Decision Making Framework of an Electricity Retailer Considering Aggregated Optimal Charging and Discharging of Electric Vehicles
This paper proposes a novel decision making framework for an electricity retailer to procure its electric demand in a bilateral-pool market in presence of charging and discharging of electric vehicles (EVs). The operational framework is a two-stage programming model in which at the first stage, the retailer and EV aggregator do their medium-term planning. Determination of retailer's optimum sel...
متن کاملA novel risk-based analysis for the production system under epistemic uncertainty
Risk analysis of production system, while the actual and appropriate data is not available, will cause wrong system parameters prediction and wrong decision making. In uncertainty condition, there are no appropriate measures for decision making. In epistemic uncertainty, we are confronted by the lack of data. Therefore, in calculating the system risk, we encounter vagueness that we have to use ...
متن کاملAsynchronous Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems
A distributed constraint satisfaction problem (Distributed CSP) is a CSP in which variables and constraints are distributed among multiple automated agents, and various application problems in Distributed Artificial Intelligence can be formalized as Distributed CSPs. We develop a new algorithm for solving Distributed CSPs called asynchronous weak-commitment search, which is inspired by the weak...
متن کاملAsynchronous Parallel Bayesian Optimisation via Thompson Sampling
We design and analyse variations of the classical Thompson sampling (TS) procedure for Bayesian optimisation (BO) in settings where function evaluations are expensive, but can be performed in parallel. Our theoretical analysis shows that a direct application of the sequential Thompson sampling algorithm in either synchronous or asynchronous parallel settings yields a surprisingly powerful resul...
متن کاملA Mathematical Framework for Asynchronous, Distributed, Decision-Making Systems with Semi-Autonomous Entities: Algorithm Synthesis, Simulation, and Evaluation
For many military and civilian large-scale, realworld systems of interest, data are first acquired asynchronously, i.e. at irregular intervals of time, at geographically-dispersed sites, processed utilizing decision-making algorithms, and the processed data then disseminated to other appropriate sites. The term real-world refers to systems under computer control that relate to everyday life and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011